منابع مشابه
A Model for Parallel Programming
ion mechanisms are more important in parallel programming because abstraction a ects performance. 1.4 Limited Architectures One of the consequences of programming systems that bind parallelism with special language constructs is that many parallel programming systems work well on only one architecture because the underlying model assumes a speci c, limited hardware con guration. The appropriate...
متن کاملADA: A Language for Robot Programming?
Robot programming languages are emerging from their experimental stage and entering an assessment phase. Their main features are illustrated and a parallel with ADA is proposed. The comparison is positive for ADA, in the sense that ADA provides most of the required capabilities. The ability of reasoning on object models and taking decisions will play an increasing role in the future. In this ca...
متن کاملProgramming with a Parametrized Parallel Programming Model
We present a new experimental framework, the F-PRAM model, for modeling and studying the effects of different properties of parallel machines. The goal of the new model is to provide programmer-level facilities for more accurate and portable computation-communication balancing. As a computation model, F-PRAM provides shared memory but guides the usage of the shared memory by a set of parameters...
متن کاملA model for parallel programming over CORBA
Existing models for parallel programming over Common Object Request Broker Architecture (CORBA) do not address issues specific to parallel programming over a Network of Workstations (NOWs). This paper presents P-CORBA, a model for parallel programming over CORBA that addresses these issues. Transmission and distribution of computing power of a NOW is facilitated by P-CORBA. The main contributio...
متن کاملA parallel inference model for logic programming
In this paper, we describe a parallel inference model for logic programming on general-purpose multicomputers. In the model, input clauses are partitioned into subsets, and resolution is conducted on each subset concurrently. The partitions are dynamically adjusted via clause migration as inference proceeds. This allows each processor to work on virtually the whole clause set while a shorter re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGAda Ada Letters
سال: 2011
ISSN: 1094-3641
DOI: 10.1145/2070336.2070350